Symbol Grounding and Inference in Natural Language Processing
نویسندگان
چکیده
منابع مشابه
Joint Inference for Natural Language Processing
of the Invited Talk In recent decades, researchers in natural language processing have made great progress on welldefined subproblems such as part-of-speech tagging, phrase chunking, syntactic parsing, named-entity recognition, coreference and semantic-role labeling. Better models, features, and learning algorithms have allowed systems to perform many of these tasks with 90% accuracy or better....
متن کاملSymbol Grounding Revisited 1 the Origin of Symbol Grounding 1.1 Overview 1.2 the Symbol Grounding Problem
Symbol Grounding has originated in the domain of cognitive connectionism as an approach to a model of language acquisition.It has, however, transcended this restricted domain and its most prominent proponents now regard it as a technique which is of general importance to the connectionist-symbolic debate, especially for their integration into a common framework. This paper revisits the claims m...
متن کاملGrounding natural language quantifiers in visual attention
The literature on vague quantifiers in English (words like “some”, “many”, etc.) is replete with demonstrations of context effects. Yet little attention has been paid to the issue of where such effects come from. We explore the possibility that such they emanate from a visual attentional bottleneck which limits the accuracy of judgments of number in visual scenes under conditions of time pressu...
متن کاملA Study on Inference Control in Natural Language Processing
Natural language processing requires exible control of computation on various sorts of constraints such as syntax, semantics, pragmatics. This study aims to propose and verify a new approach that describes a system declaratively with constraints and controls inferences guided by general principles based on probability. This approach is an alternative one against the previous procedural approach...
متن کاملLagrangian Relaxation for Inference in Natural Language Processing
There has been a long history in combinatorial optimization of methods that exploit structure in complex problems, using methods such as dual decomposition or Lagrangian relaxation. These methods leverage the observation that complex inference problems can often be decomposed into efficiently solvable sub-problems. Thus far, however, these methods are not widely used in NLP. In this talk I will...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Robotics Society of Japan
سال: 2015
ISSN: 0289-1824,1884-7145
DOI: 10.7210/jrsj.33.77